Homological Properties of Non-deterministic Branchings and Mergings in Higher Dimensional Automata
نویسندگان
چکیده
The branching (resp. merging) space functor of a flow is a left Quillen functor. The associated derived functor allows to define the branching (resp. merging) homology of a flow. It is then proved that this homology theory is a dihomotopy invariant and that higher dimensional branchings (resp. mergings) satisfy a long exact sequence.
منابع مشابه
Combinatorics of branchings in higher dimensional automata
We explore the combinatorial properties of the branching areas of paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner homology of a globular ω-category and the combinatorics of a new homology theory called the reduced negative corner homology. This latter is the homology of the quotient of the corner complex by the sub-co...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملFrom Determinism to Non-determinism in Recognizable Two-Dimensional Languages
Tiling systems that recognize two-dimensional languages are intrinsically non-deterministic models. We introduce the notion of deterministic tiling system that generalizes deterministic automata for strings. The corresponding family of languages matches all the requirements of a robust deterministic class. Furthermore we show that, differently from the one-dimensional case, there exist many cla...
متن کاملTowards an Homotopy Theory of Process Algebra
This paper proves that labelled flows are expressive enough to contain all process algebras which are a standard model for concurrency. More precisely, we construct the space of execution paths and of higher dimensional homotopies between them for every process name of every process algebra with any synchronization algebra using a notion of labelled flow. This interpretation of process algebra ...
متن کاملReduction of BL-general L-fuzzy Automata
In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...
متن کامل